Laslett's line segment problem

9. Line Segment Intersections

Farthest line segment Voronoi diagrams

The farthest line segment Voronoi diagram shows properties different from both the closest-segment Voronoi diagram and the farthest-point Voronoi diagram. Surprisingly, this structure did not receive attention in the computational geometry literature. We analyze its combinatorial and topological properties and outline an O(n log n) time construction algorithm that is easy to implement. No restr...

LSD: a Line Segment Detector

LSD is a linear-time Line Segment Detector giving subpixel accurate results. It is designed to work on any digital image without parameter tuning. It controls its own number of false detections: on average, one false alarm is allowed per image [1]. The method is based on Burns, Hanson, and Riseman’s method [2], and uses an a contrario validation approach according to Desolneux, Moisan, and More...

The Multiscale Line Segment Detector

We propose a multiscale extension of a well-known line segment detector, LSD. We show that its multiscale nature makes it much less susceptible to over-segmentation and more robust to low contrast and less sensitive to noise, while keeping the parameter-less advantage of LSD and still being fast. We also present here a dense gradient filter that disregards regions in which lines are likely to b...

Line Segment Rasterization in N-dimensional Space Line Segment Rasterization in N-dimensional Space

The rapid development of scanning and measuring hardware for medical imaging and for scientiic experiments, the introduction of animation techniques into common use have created the need to understand n-dimensional raster geometry, where n > 3. After a brief review of continuous geometry in R n , this paper presents the discrete regular structure called a hyperlattice used for deening n-dimensi...